Privacy-preserving verifiable delegation of polynomial and matrix functions
نویسندگان
چکیده
منابع مشابه
Practically Efficient Verifiable Delegation of Polynomial and its Applications
In this paper, we propose a novel one-way function, which is equivalent to large integer factorization. From this new one-way function, we construct a novel verifiable delegation scheme for polynomial. Our contribution is twofold: in the practice aspect, our proposed polynomial delegation scheme is about 100 times faster than the existing solutions [1, 2] and has constant key size where the exi...
متن کاملPrivacy Preserving Dynamic Access Control Model with Access Delegation for eHealth
eHealth is the concept of using the stored digital data to achieve clinical, educational, and administrative goals and meet the needs of patients, experts, and medical care providers. Expansion of the utilization of information technology and in particular, the Internet of Things (IoT) in eHealth, raises various challenges, where the most important one is security and access control. In this re...
متن کاملPublicly Verifiable Privacy-Preserving Group Decryption
Anonymity is one of the main concerns in group-oriented cryptography. However, most efforts, for instance, group signatures and ring signatures, are only made to provide anonymity on the sender’s side. There are merely few works done to ensure anonymity in a cryptographic sense on the recipient’s side in group-oriented communications. This paper formalizes the notion of group decryption (GD). I...
متن کاملVerifiable Delegation of Polynomials
Verifiable computation allows a computationally weak client to outsource evaluation of a function on many inputs to a powerful but untrusted server. The client invests a large amount of off-line computation in an amortized manner to obtain an encoding of its function which is then given to the server. The server returns both the evaluation result of the function on the client’s input and a proo...
متن کاملPrivacy preserving, verifiable and efficient outsourcing algorithm for matrix multiplication to a malicious cloud server
Matrix Multiplication is a basic engineering and scientific problem, which has application in various domains. There exists many cryptographic solutions for secure computation of matrix multiplication, but cryptographic preamble makes them infeasible for outsourcing with large input size to the cloud server. In this paper, we propose a privacy-preserving, verifiable and efficient algorithm for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2020
ISSN: 1862-2984,1862-2976
DOI: 10.1515/jmc-2018-0039